A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
نویسندگان
چکیده
منابع مشابه
A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
In this study, we improved the variable neighborhood search (VNS) algorithm for solving uncapacitated multilevel lot-sizing (MLLS) problems. The improvement is two-fold. First, we developed an effective local search method known as the Ancestors Depth-first Traversal Search (ADTS), which can be embedded in the VNS to significantly improve the solution quality. Second, we proposed a common and e...
متن کاملA variable neighborhood search based approach for uncapacitated multilevel lot-sizing problems
In this paper, an effective approach based on the variable neighborhood search (VNS) algorithm is presented to solve the uncapacitated multilevel lot-sizing (MLLS) problems with component commonality and multiple end-items. A neighborhood structure for the MLLS problem is defined, and two kinds of solution move policies, i.e., move at first improvement (MAFI) and move at best improvement (MABI)...
متن کاملVariable Neighborhood Search Based Approach for Solving Multilevel Lot-Sizing Problems
In this paper, we present an effective approach based on the variable neighborhood search (VNS) for solving multilevel lot-sizing (MLLS) problems. Two kinds of neighborhood search strategies, i.e., move at first improvement (MAFI) and move at best improvement (MABI), are adopted to improve the performance of proposed algorithm. Computational experiments are carried out on 96 benchmark problems ...
متن کاملFix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems ¬リニ
In this paper, a new fix-and-optimize (FO) approach is proposed for two dynamic multi-level capacitated lot sizing problems (MLCLSP), the MLCLSP without setup carryover and the MLCLSP with setup carryover. Given an MIP model of a lot sizing problem, the approach iteratively solves a series of subproblems of the model until no better solution can be found. Each sub-problem re-optimizes a subset ...
متن کاملHybrid Tabu Search for Lot Sizing Problems
This paper presents a hybrid tabu search strategy for lot sizing problems. This strategy allows the exploitation of the quality of the well-known relax-and-fix heuristic, inside a tabu search framework which enforces diversity. The computational results show an advantage of this strategy when compared to a version of the relax-and-fix heuristic and to time constrained branch-and-bound.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2014
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2013.10.025